Glucose: a Solver That Predicts Learnt Clauses Quality *
نویسندگان
چکیده
GLUCOSE is based on a new scoring scheme for the clause learning mechanism, based on the paper [Audemard and Simon, 2009]. This short competition report summarizes the techniques embedded in the competition 09 version of GLUCOSE. Solver’s name comes from glue clauses, a particular kind of clauses that GLUCOSE detects and preserves during search. The web page for GLUCOSE is http://www.lri.fr/ ̃simon/glucose.
منابع مشابه
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers
Learnt clauses in CDCL SAT solvers often contain redundant literals. This may have a negative impact on performance because redundant literals may deteriorate both the effectiveness of Boolean constraint propagation and the quality of subsequent learnt clauses. To overcome this drawback, we define a new inprocessing SAT approach which eliminates redundant literals from learnt clauses by applyin...
متن کاملUsing Community Structure to Detect Relevant Learnt Clauses
Nowadays, Conflict-Driven Clause Learning (CDCL) techniques are one of the key components of modern SAT solvers specialized in industrial instances. Last years, one of the focuses has been put on strategies to select which learnt clauses are removed during the search. Originally, one need for removing clauses was motivated by the finiteness of memory. Recently, it has been shown that more aggre...
متن کاملLySAT: solver description
LySAT is a DPLL-based satisfiability solver which includes all the classical features like lazy data-structures and activity-based decision heuristics. It differs from well known satisfiability solvers such as Rsat [6] and MiniSAT [3] on many important components such as restart strategies and clause learning. In addition to the classical first-UIP scheme, it incorporates a new technique which ...
متن کاملUsing Learnt Clauses in maxsat
maxsat is an optimization version of SAT capable of expressing a variety of practical problems. maxsat solvers have been designed to take advantage of many of the successful techniques of SAT solvers. However, the most important technique of modern SAT solvers, clause learning, has not been utilized since learnt clauses cannot be soundly added to a maxsat theory. In this paper we present a new ...
متن کاملSugar++: A SAT-Based MAX-CSP/COP Solver
This paper briefly describes some features of Sugar++, a SAT-based MAXCSP/COP solver entering the Third International CSP Solver Competition. In our approach, a MAX-CSP is translated into a Constraint Optimization Problem (COP), and then it is encoded into a SAT problem by the order encoding method [1]. SAT-encoded COP can be efficiently solved by repeatedly using the MiniSat solver [2]. The or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009